The Speed of Hereditary Properties of Graphs
نویسندگان
چکیده
Given a property P of graphs, write P for the set of graphs with vertex set [n] having property P. The growth or speed of a property P can be discussed in terms of the values of |P|. For properties with |P|<n hereditary properties are surprisingly well determined by their speeds. Sharpening results of E. R. Scheinerman and J. Zito (1994, J. Combin. Theory Ser. B 61, 16 39), we prove numerous results about the possible functions |P| and describe in detail the properties exhibiting each type of growth. We also list minimal properties exhibiting each type of growth.
منابع مشابه
A Note on the Speed of Hereditary Graph Properties
For a graph property X, let Xn be the number of graphs with vertex set {1, . . . , n} having property X, also known as the speed of X. A property X is called factorial if X is hereditary (i.e. closed under taking induced subgraphs) and n1 ≤ Xn ≤ n c2n for some positive constants c1 and c2. Hereditary properties with the speed slower than factorial are surprisingly well structured. The situation...
متن کاملar X iv : m at h / 07 02 35 2 v 1 [ m at h . C O ] 1 3 Fe b 20 07 HEREDITARY PROPERTIES OF ORDERED GRAPHS
An ordered graph is a graph together with a linear order on its vertices. A hereditary property of ordered graphs is a collection of ordered graphs closed under taking order-preserving isomorphisms of the vertex set, and order-preserving induced subgraphs. If P is a hereditary property of ordered graphs, then Pn denotes the collection {G ∈ P : V (G) = [n]}, and the function n 7→ |Pn| is called ...
متن کاملHereditary properties of combinatorial structures: Posets and oriented graphs
A hereditary property of combinatorial structures is a collection of structures (e.g. graphs, posets) which is closed under isomorphism, closed under taking induced substructures (e.g. induced subgraphs), and contains arbitrarily large structures. Given a property P, we write Pn for the number of distinct (i.e., nonisomorphic) structures in a property P with n elements, and call the sequence (|...
متن کاملOn factorial properties of chordal bipartite graphs
For a graph property X, let Xn be the number of graphs with vertex set {1, . . . , n} having property X, also known as the speed of X. A property X is called factorial if X is hereditary (i.e. closed under taking induced subgraphs) and n1 ≤ Xn ≤ n2 for some positive constants c1 and c2. Hereditary properties with the speed slower than factorial are surprisingly well structured. The situation wi...
متن کاملar X iv : m at h / 07 02 35 0 v 1 [ m at h . C O ] 1 3 Fe b 20 07 HEREDITARY PROPERTIES OF COMBINATORIAL STRUCTURES : POSETS AND ORIENTED GRAPHS
A hereditary property of combinatorial structures is a collection of structures (e.g. graphs, posets) which is closed under isomorphism, closed under taking induced substructures (e.g. induced subgraphs), and contains arbitrarily large structures. Given a property P , we write Pn for the collection of distinct (i.e., nonisomorphic) structures in a property P with n vertices, and call the functi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 79 شماره
صفحات -
تاریخ انتشار 2000